Low-power Booth-encoded array multiplier

ABSTRACT

An enhanced Booth-encoded adder-array multiplier where the low transition probability partial-products are generated and the adder array has been reorganized to reduce power dissipation when the Booth-encoded input has a large dynamic range. The architecture does not require extra circuits or routing overhead. Power dissipation is reduced by ordering the sequence of partial-product additions such that an increasing sequence of “transition probabilities” is encountered.

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application claims priority from U.S. provisional application serial No. 60/328,365 filed on Oct. 9, 2001, incorporated herein by reference.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

[0002] This invention was made with Government support under Grant No. MIP-9632698, awarded by the National Science Foundation. The Government has certain rights in this invention.

REFERENCE TO A COMPUTER PROGRAM APPENDIX

[0003] Not Applicable

BACKGROUND OF THE INVENTION

[0004] 1. Field of the Invention

[0005] The present invention pertains generally to array multipliers, and more particularly to a Booth-encoded array multiplier architecture wherein low transition probability partial-products are generated, and the adder array is re-arranged according to the partial-products' signal transition probabilities.

[0006] 2. Description of the Background Art

[0007] Multiplication is a ubiquitous operation in digital signal processing (DSP) applications. The well-known modified Booth-encoding algorithm reduces the number of partial products that must be added and is widely used in VLSI implementations of multiplication. Referring to FIG. 1, a Booth-encoded multiplier 10 typically comprises the following elements: a Booth-encoder 12, a partial-product generator 14, a partial-product summation array 16, and a final carry-propagation adder 18.

[0008] The radix-4 Booth encoding algorithm is commonly used in DSP applications. For multiplication XY, the radix-4 Booth-encoding algorithm encodes an N-bit two's complement number Y, one bit-pair at a time, into a set of signed-digits $\left( {S_{0,},S_{\frac{N}{2} - 1}} \right)$

[0009] according to Table 1. In FIG. 1, S₀ is the least significant digit (LSD) and $S_{\frac{N}{2} - 1}$

[0010] is the most-significant digit (MSD). To reduce the switching activity, and hence the power dissipation, in the partial-product generators and the adders, it is understood to be preferable to encode both a string of zeros and a string of ones as +0, as indicated by the bold +0 entries in Table 1. We define such a Booth-encoding method as “+0 Booth-encoding”. See, for example, C. J. Nicol and P. Larsson, “Low power multiplication for FIR filters,” in Proceedings of International Symposium on Low Power Electronics and Design, August 1997, pp. 76-79, incorporated herein by reference.

[0011] The partial-product generator 14 produces a partial-product Q_(i) (generated using a simple shift and complement) according to multiplicand X and a signed-digit S_(i). In FIG. 1, Q₀ is the LSD partial-product and it has the shortest word-length.

[0012] Referring to FIG. 2, as an example, a “standard” 8×8 Booth-encoded carry-save array multiplier 50 is shown. As used herein, the term “standard” means a conventional array multiplier structure with or without Booth-encoding wherein partial-products are added sequentially from the LSD partial-product to the MSD partial-product. By way of example, and not of limitation, FIG. 2 shows a “standard” array multiplier of the carry-save type. A standard carry-save array is a regular structure in which the partial-products are added together sequentially, with increasing word-length, starting with the LSD partial-product Q₀. In other words, a standard array multiplier adds the partial-products starting with the shorter word-lengths. Note that the sign-extensions of the two's complement numbers are taken care of by a compensation vector added in the adder array. See, for example, L. K. Tan, “High performance multiplier and adder compilers,” M.S. thesis, UCLA, 1992, incorporated herein by reference. Other partial-product summation techniques can be employed in a manner that will be compatible with the present invention. In addition to carry-save adders, for example, the use of 4-to-2 compressors and dual-carry-save arrays can be employed, as will be evident to one skilled in the art.

[0013] As can be seen, the well-known modified Booth-encoding algorithm reduces the number of partial-products and is widely used in multipliers for DSP applications. The use of +0 Booth-encoding can reduce the transition probability of the partial-products. However, the switching of the partial products causes signal transitions in the partial-product adder array, and spurious transitions and logic races that flow through the adder array are major sources of power dissipation in multipliers. Accordingly, there is a need for an array configuration where unnecessary switching activity in the array is reduced.

BRIEF SUMMARY OF THE INVENTION

[0014] In many DSP applications, the magnitude of a digital signal does not always occupy the entire extent of its word-length. For a two's complement number Y with small-magnitude, its most-significant-bits (MSBs) are strings of zeros or ones, which are Booth-encoded as +0. This implies that the corresponding most-significant-digit (MSD) partial-products have a high probability of being zero and a low switching probability. However, referring to the standard 8×8 Booth-encoded carry-save array multiplier 50 in FIG. 2, even if Q₂ and Q₃ are zero, the second and the third adder rows will be switching because of the signal transitions propagating from the first adder row. These transitions are redundant since they are simply computing an addition of zero.

[0015] In accordance with the present invention, the adder array in an array multiplier should be configured according to a probabilistic property of the partial-products, so that the switching activity in the array is reduced. In other words, the partial-products are added according to their transition probabilities. This “reorganized” partial-product addition arrangement has all the advantages of a traditional adder array but with reduced power dissipation. The architecture of the present invention recognizes a useful feature of the signed-digit encoding property of the +0 Booth-encoding algorithm and uses it to exploit the high dynamic range property typical of many signals in DSP applications. Various addition operations and styles can be employed in the present invention, including but not limited to carry-save adders, 4-to-2 compressors, dual-carry-save arrays, and tree-style adder arrays.

[0016] By way of example, and not of limitation, for DSP applications a carry-save array structure according to the present invention is configured to add the partial-products sequentially starting with the MSD partial-product (e.g., see FIG. 3). For example, in the present invention, if Q₂ and Q₃ are zero, the first adder row will have no signal transition whatsoever. This structure is counterintuitive because the MSD partial-products have a longer word-length and it would appear that extra hardware would be needed. However, by reconfiguring a few adder cells and changing certain local connections (e.g., adders 104, 106 in FIG. 3), a structure such as shown in FIG. 3 can produce the same output as the standard carry-save adder array shown in FIG. 2 without requiring extra hardware. Such an adder array structure preserves the regularity and locality of a standard carry-save array, and has approximately the same complexity and delay, but with reduced power dissipation. We emphasize that the same sum is obtained by our MSD-first partial-product addition technique example in FIG. 3 as using a standard carry-save adder array in FIG. 2. For other purposes, other types of MSD-first computations have been advocated. In M. D. Ercegovac and T. Lang, “Fast multiplication without carry-propagate addition,” IEEE Transactions on Computers, vol. 39, November 1990, pp 1385-1390, incorporated herein by reference, a different type of MSD-first computation is described. It obtains a different result; an error is included in the result. Our method makes no such error. Also notice that the prior art is limited to sign-magnitude signal representation input and output, while the presented invention discusses the arithmetic under two's complement numbers. When we refer to a computation wherein partial-products are added starting with a most-significant digit (MSD) partial-product, we define that to mean the type of MSD-first computation described in the present invention, not any of the other types that might have been conceived elsewhere. Our method, in particular, yields the same result, exactly, as would be obtained by a conventional LSD-first approach. It does so, however, while dissipating less power.

[0017] An advantage of an adder array configured according to the present invention is that its organization opposes the carry-propagation direction. Therefore, few signals need to propagate through the entire adder array. Another advantage is that such a structure reduces the number of long signal paths and hence reduces the switching activity in the adder array. Further advantages of the invention will be brought out in the following portions of the specification, wherein the detailed description is for the purpose of fully disclosing preferred embodiments of the invention without placing limitations thereon.

BRIEF DESCRIPTION OF THE DRAWINGS

[0018] The invention will be more fully understood by reference to the following drawings which are for illustrative purposes only:

[0019]FIG. 1 is a schematic diagram showing the general architecture of a standard Booth-encoded multiplier.

[0020]FIG. 2 is a schematic diagram showing the architecture of a standard 8×8 Booth-encoded carry-save array multiplier.

[0021]FIG. 3 is a schematic diagram showing the architecture of a low-power 8×8 Booth-encoded carry-save array multiplier according to the present invention.

DETAILED DESCRIPTION OF THE INVENTION

[0022] The power dissipation of a high-speed CMOS circuit is dominated by the dynamic switching power, which is proportional to the transition probability in the circuit. For a signal s we denote p(s) as the probability of s being non-zero and p_(Δ)(s) as its transition probability. See, Qing Wu, M. Pedram, and Xunwei Wu, “A note on the relationship between signal probability and switching activity”, in Proc. Asia and South Pacific Design Automation Conf., 1997, pp. 117-120, incorporated herein by reference. For random binary signals,

p _(Δ)(s)=2p(s)(1−p(s)).

[0023] Since p_(Δ)(s) achieves its maximum at p(s)=0.5, p_(Δ)(S) is reduced if p(s) is skewed away from 0.5. For p(s)≦0.5, we seek to reduce p(s).

[0024] A transition at a circuit node may cause glitches in the combinatorial circuits fed by the node. The longer the logic depth, the more the capacitance that is affected due to glitching. To reduce the spurious transitions, it is desirable to assign a signal that has high switching probability to circuits having short logic depth. The switching activity in an adder array is related to the character of its inputs, the partial products. This relationship forms the intuition behind the proposed structure; it is reflected in two aspects as follows:

[0025] First, the switching of a partial-product causes spurious transitions and logic races that flow through the adder array. We seek to assign those partial-products having high switching probability a short signal path. In a carry-save array multiplier, for example, the partial-product first added affects a long logic path in the adder array. Therefore, it is desirable that this partial-product have a low switching probability. This leads to a carry-save array structure that adds the partial-products sequentially in the order of non-decreasing p_(Δ)(Q_(i)).

[0026] Second, the one probability of partial-products affects the transition probability in the adder array. Those skilled in the art will recognize that the sum signals in the adder array have a one probability close to 0.5 and that the one probability of a carry signal is given by:

p(C ₁)=p(Q _(m))p(Q _(n))

[0027] where Q_(m) and Q_(n) are the two partial-products added in the first adder row, and

p(C _(k))=0.5p(C _(k−1))+0.5p(Q _(i)), for k>1,

[0028] where C_(k) is a carry output of the k-th adder row, and Q_(i) is a partial-product added into the k-th adder row. (As shown in FIG. 2, the standard carry-save array adds the LSD partial-products first, and has i=k for k>1). In a carry-save array multiplier as shown in FIG. 2, the carry outputs of the first adder row have the longest signal path to the array output. Therefore, we should aggressively reduce the carry transition probability in the first few adder rows. Assuming the Booth-encoder input is a random binary signal, we have p(Q_(i))<0.5 and p(C_(k))<0.5. See, K. -Y. Knoo, Z. Yu and A. N. Willson, Jr. “Improved Booth-encoding for low-power multipliers,” in Proceedings of the IEEE International Symposium on Circuits and Systems, May 1999, pp. 62-65, incorporated herein by reference. We can reduce the transition probability of the carry signal p_(Δ)(C_(k)) by reducing its one probability p(C_(k)). To minimize p(C₁), Q_(m) and Q_(n) should have the minimum p(Q_(m)) and p(Q_(n)). Since p(C₂)=0.5p(C₁)+0.5p(Q_(i)), we should pick the minimum p(Q_(i)) among the rest of the partial-products to minimize p(C₂). Consequently, the partial-products should be added sequentially in the order of non-decreasing p(Q_(i)), starting with the one that has the minimum p(Q_(i)).

[0029] The above two observations give us a guideline on the ordering of the partial-product inputs in an adder array to reduce power dissipation.

[0030] It will be appreciated that, in many DSP applications, the magnitude of a digital signal does not always occupy the entire dynamic range of its wordlength. For example, the coefficients of an adaptive filter might vary over a large range during a training period, but only have a small magnitude once converged. Consider how such a signal property affects the partial-product statistics in a Booth-encoded multiplier. It is known that

p(Q_(i))=p(X)p(S _(i))

[0031] and p(Q_(i)) is reduced as p(S_(i)) decreases. For a two's complement number that has a smaller magnitude than its word-length, the most-significant bits (MSBs) are repeated sign-extension bits, which are strings of zeros or ones. These signal patterns are Booth-encoded as +0. This implies that the MSD of the Booth-encoder output has low p(S_(i)) and the corresponding MSD partial-product has a low p(Q_(i)).

[0032] For a random signal X, p(X)=0.5; therefore, p(Q_(i))=p(S_(i))p(X)≦0.5. Since p(Q,)<0.5, low p(Q_(i)) implies reduced p_(Δ)(Q_(i)). Also, for a digital signal Y that varies in a small range, its MSBs switch less frequently, hence, so do the corresponding Booth signed-digit and the partial-product. Therefore, the MSD partial-products have low p_(Δ)(Q_(i)).

[0033] From the foregoing, we now know that the MSD partial-products have both small p(Q_(i)) and p_(Δ)(Q_(i)). Combining this fact and our observations on the transition activity in a carry-save array, we conclude for purposes of the present invention that it is desirable to first (not last) add the MSD partial-products in a carry-save array for reduced circuit switching. Accordingly, the present invention comprises a carry-save array structure that adds the partial-products sequentially with decreasing wordlength, starting with the MSD partial-product.

[0034] Referring now to FIG. 3, an example of an embodiment of an 8×8 Booth-encoded carry-save array multiplier 100 according to the present invention is shown. As can be seen, the partial-products are added according to their transition probabilities. In the case of a DSP application and the use of Booth-encoding, the partial-products are added sequentially starting with the MSD partial-product which has a longer word-length than the LSD partial-product. Note that if Q₂ and Q₃ are zero, the first adder row will have no signal transition whatsoever. Such a structure is counterintuitive because the MSD partial-products have a longer word-length and it might seem that extra hardware (e.g., rows of half-adders (HA) where the dashed boxes 102 are shown in FIG. 3) would be needed at the MSB side of the adder array. However, the adder array only requires outputs of at most two signals per bit position with the final carry-propagation adder being used to sum up the carry-save signal. We can fulfill such a requirement by using a few adder cells (e.g., half-adders 104 and a full adder 106) at the MSB side of the adder array and by changing some local connections in the carry-save array without having to use adders where the dashed boxes 102 are shown. Such an adder array will produce the same output as the array in FIG. 2 and preserves the regularity and locality of a standard carry-save array. A careful examination of the structure of FIG. 3 shows that it has approximately the same complexity (11 FAs and 15 HAs) and approximately the same delay as the standard carry-save array shown in FIG. 2 (which employs 14 FAs and 9 HAs). It also yields the same sum.

[0035] Note that a carry-save array multiplier according to the present invention is particularly useful for XY when a Booth-encoded input Y is close to zero. In an application where Y is close to its maximum value, the low-power multiplier of the present invention can also be applied with some modifications. Assume Y is an N-bit number {y_(N−1), . . . , y₀} and it represents integer values between −2^(N−1) and 2^(N−1). Define {overscore (Y)}={{overscore (y)}_(N−1), . . . {overscore (y)}_(N−2), . . . , {overscore (y)}₁, {overscore (y)}₀} and we know that, for a two's complement number, −Y={overscore (Y)}+1. Also define Ŷ={y_(N−1), {overscore (y)}_(N−2), . . . , {overscore (y)}₁, {overscore (y)}₀} and we have {circumflex over ({overscore (Y)})}={{overscore (y)}_(N−1), y_(N−2), y₁, y₀}. Now consider the following two cases:

[0036] (a) Y is positive and close to 2^(N−1)−1. We can rewrite Y=(2^(N−1)−1)−Ŷ where Ŷ is a small positive number. The original multiplication XY becomes

XY=(2^(N−1)−1)X−XŶ=2^(N−1) X−X(1+Ŷ)=2^(N−1) X+X{circumflex over ({overscore (Y)})},

[0037] and 2^(N−1) X is simply a shift of X, which can be accumulated after the multiplication (according to the present invention) that computes X{circumflex over ({overscore (Y)})} or merged with the multiplier's adder array.

[0038] (b) Y is negative and close to −2^(N−1). We can rewrite Y=(−2^(N−1))−Ŷ where Ŷ is a small negative number. Similarly,

XY=(−2^(N−1))X−XŶ=−2^(N−1) X−X(1+Ŷ)=−2^(N−1) X+X{circumflex over ({overscore (Y)})},

[0039] and again the multiplier of the present invention can be applied for low power.

[0040] We also observe that the present invention is not limited to the use of carry-save adder arrays. Other partial-product summation techniques can be applied, for example, the use of 4-to-2 compressors and dual-carry-save arrays. In all cases, for low power dissipation, the partial-products should be added in an order that causes increasing signal transition probabilities for successive additions, rather than being ordered in terms of increasing word-length as is usually the case for conventional methods. At the same time, the +0 Booth-encoding should be applied together with array re-arrangement for more power reduction.

EXAMPLE 1

[0041] Several multiplier circuits were implemented in a 0.5 μm technology using Synopsys Design Compiler™ for synthesis and Cadence™ for place and route. We used a set of well-characterized leaf-cells with state-dependent power dissipation, and the interconnect parasitic information was extracted from the layout. The circuits were simulated at a clock speed of 10 MHz in Verilog™, the toggle rates of all of the nodes were calculated, and the power dissipation was reported using Synopsys Design Power™. Our multiplier implementation did not include the final carry-propagation adder because its power characteristic has been well studied and it is not the focus of this invention.

[0042] We first simulated the power dissipation of the multipliers when the Booth-encoded input signal had a dynamic range smaller than its word-length. The other input of the multiplier was a random signal. The simulation results are summarized in Table 2 for a conventional multiplier (std.) and a multiplier according to the invention (inv.). As expected, more power savings are achieved when the input signal has a small magnitude. This corresponds to the case when the MSD partial-products are zero, and the first few adder rows in the proposed structure do not switch at all. (By contrast, all the adder cells in the standard carry-save array switch due to the transitions in the LSD partial-products). Table 2 shows that the invention actually has reduced power dissipation for signals of all dynamic ranges. Table 3 shows that the architecture of the present invention does not require extra circuits or routing overhead.

EXAMPLE 2

[0043] The invention was also applied in a multiplexed FIR filter running at a clock speed of 10 MHz. The filter coefficients were Booth-encoded and the other multiplier input was a random signal. The power dissipation for various multiplier sizes is summarized in Table 3 and, as can be seen, an over 18% power reduction has been achieved.

[0044] Accordingly, the present invention comprises a low-power array multiplier which is preferably Booth-encoded for many applications. Its architecture is suitable for DSP applications where one of the input signals has a large dynamic range. We take advantage of the encoding property of a Booth encoder and modify the standard adder array to reduce the total switching activity inside the array. As a result, power dissipation is reduced.

[0045] Although the description above contains many specificities, these should not be construed as limiting the scope of the invention but as merely providing illustrations of some of the presently preferred embodiments of this invention. Thus the scope of this invention should be determined by the appended claims and their legal equivalents. Therefore, it will be appreciated that the scope of the present invention fully encompasses other embodiments which may become obvious to those skilled in the art, and that the scope of the present invention is accordingly to be limited by nothing other than the appended claims, in which reference to an element in the singular is not intended to mean “one and only one” unless explicitly so stated, but rather “one or more.” All structural, chemical, and functional equivalents to the elements of the above-described preferred embodiment that are known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the present claims. Moreover, it is not necessary for a device or method to address each and every problem sought to be solved by the present invention, for it to be encompassed by the present claims. Furthermore, no element, component, or method step in the present disclosure is intended to be dedicated to the public regardless of whether the element, component, or method step is explicitly recited in the claims. No claim element herein is to be construed under the provisions of 35 U.S.C. 112, sixth paragraph, unless the element is expressly recited using the phrase “means for.” TABLE 1 Booth-Encoding Y_(2i+1) Y_(2i) Y_(2i−1) S_(i) 0 0 0 +0 0 0 1 +1 0 1 0 +1 0 1 1 +2 1 0 0 −2 1 0 1 −1 1 1 0 −1 1 1 1 +0

[0046] TABLE 2 Power Comparisons Dy- namic 16 × 16 multiplier 12 × 12 multiplier 8 × 8 multiplier Range Power (mW) Power (mW) Power (mW) (bits) Std. Inv. % Std. Inv. % Std. Inv. % 16 16.62 16.21 −2.5 15 16.47 15.86 −3.7 14 15.77 14.44 −8.5 13 15.41 14.00 −9.1 12 14.27 12.38 −13.3 7.38 7.34 −0.5 11 13.95 11.86 −15.0 7.28 7.15 −1.8 10 12.81 10.01 −21.8 6.87 6.31 −8.3 9 12.10 9.16 −24.2 6.53 5.92 −9.4 8 10.66 7.26 −31.9 5.87 4.95 −15.6 2.36 2.33 −1.3 7 10.16 6.80 −33.1 5.59 4.64 −17.0 2.29 2.23 −2.6 6 8.36 5.19 −37.9 4.71 3.50 −25.7 2.03 1.84 −9.3 5 7.81 4.67 −40.2 4.39 3.12 −28.8 1.89 1.67 −11.8 4 6.21 3.32 −46.6 3.49 2.13 −39.0 1.49 1.22 −18.1 3 5.33 2.84 −46.7 2.98 1.78 −40.4 1.26 1.01 −19.9 2 3.50 1.87 −46.4 1.92 1.14 −40.6 0.82 0.62 −24.7

[0047] TABLE 3 Area (mm²) and Power (mW) Comparison Multiplier Standard Invention Power Size Area Power Area Power Savings 16 × 16 0.30 14.5 0.30 11.9 18.4% 12 × 12 0.16 5.28 0.16 4.32 18.1% 8 × 8 0.07 1.10 0.07 0.88 20.1% 

What is claimed is:
 1. An array multiplier, comprising: a partial-product generator; an adder array; and means for reducing power dissipation in said adder array compared to a standard array multiplier.
 2. An array multiplier as recited in claim 1, wherein partial-products are added according to transition probabilities.
 3. An array multiplier as recited in claim 1, wherein partial-products are added starting with a most significant digit (MSD) partial product.
 4. An array multiplier as recited in claim 1, wherein said means preserves the regularity and locality of a standard array multiplier.
 5. An array multiplier as recited in claim 1, wherein said carry-save array multiplier has approximately the same complexity and delay as in a standard array multiplier.
 6. An array multiplier as recited in claim 1, wherein circuit switching is reduced in relation to a standard array multiplier.
 7. An array multiplier as recited in claim 1, wherein partial-products are added sequentially with decreasing wordlength starting with the MSD partial-product.
 8. An array multiplier as recited in claim 1, wherein said array multiplier is Booth-encoded.
 9. An array multiplier as recited in claim 1, wherein said adder array comprises a carry-save adder array.
 10. An array multiplier as recited in claim 1, further comprising means for carrying out a shift-and-add operation.
 11. An array multiplier, comprising: a partial-product generator; an adder array; and means for reducing power dissipation in said adder array by adding partial-products according to their transition probabilities.
 12. An array multiplier as recited in claim 11, wherein partial-products are added sequentially starting with the most significant digit (MSD) partial-product.
 13. An array multiplier as recited in claim 11, wherein power dissipation is reduced in relation to a standard array multiplier.
 14. An array multiplier as recited in claim 11, wherein said means preserves the regularity and locality of a standard array multiplier.
 15. An array multiplier as recited in claim 11, wherein said carry-save array multiplier has approximately the same complexity and delay as in a standard array multiplier.
 16. An array multiplier as recited in claim 11, wherein circuit switching is reduced in relation to a standard array multiplier.
 17. An array multiplier as recited in claim 11, wherein said partial-products are added sequentially according to decreasing wordlength.
 18. An array multiplier as recited in claim 11, wherein said array multiplier is Booth-encoded.
 19. An array multiplier as recited in claim 11, wherein said adder array comprises a carry-save adder array.
 20. An array multiplier as recited in claim 11, further comprising means for carrying out a shift-and-add operation.
 21. An array multiplier, comprising: a partial-product generator; and an adder array configured to add partial-partial products according to their transition probabilities.
 22. An array multiplier as recited in claim 21, wherein partial-products are added sequentially starting with the most significant digit (MSD) partial-product.
 23. An array multiplier as recited in claim 21, wherein power dissipation is reduced in relation to a standard array multiplier.
 24. An array multiplier as recited in claim 21, wherein said adder array preserves the regularity and locality of a standard array multiplier.
 25. An array multiplier as recited in claim 21, wherein said carry-save array multiplier has approximately the same complexity and delay as in a standard array multiplier.
 26. An array multiplier as recited in claim 21, wherein circuit switching is reduced in relation to a standard array multiplier.
 27. An array multiplier as recited in claim 21, wherein said partial-products are added sequentially according to decreasing wordlength.
 28. An array multiplier as recited in claim 21, wherein said array multiplier is Booth-encoded.
 29. An array multiplier as recited in claim 21, wherein said adder array comprises a carry-save adder array.
 30. An array multiplier as recited in claim 21, further comprising means for carrying out a shift-and-add operation.
 31. In an array multiplier, the improvement comprising: an adder array configured to sequentially add partial-products from a partial-product generator according to their transition probabilities.
 32. An improvement as recited in claim 31, wherein partial-products are added sequentially starting with the most significant digit (MSD) partial-product.
 33. An improvement as recited in claim 31, wherein power dissipation is reduced in relation to a standard array multiplier.
 34. An improvement as recited in claim 31, wherein said adder array preserves the regularity and locality of a standard array multiplier.
 35. An improvement as recited in claim 31, wherein said array multiplier has approximately the same complexity and delay as in a standard array multiplier.
 36. An improvement as recited in claim 31, wherein circuit switching is reduced in relation to a standard array multiplier.
 37. An improvement as recited in claim 31, wherein said partial-products are added sequentially according to decreasing wordlength.
 38. An improvement as recited in claim 31, wherein said array multiplier is Booth-encoded.
 39. An improvement as recited in claim 31, wherein said adder array comprises a carry-save adder array.
 40. An improvement as recited in claim 31, further comprising means for carrying out a shift-and-add operation.
 41. In an array multiplier having a partial product generator and an adder array, the improvement comprising: configuring the adder array to add partial-products according to their transition probabilities.
 42. An improvement as recited in claim 41, wherein partial-products are added sequentially starting with the most significant digit (MSD) partial-product.
 43. An improvement as recited in claim 41, wherein power dissipation is reduced in relation to a standard array multiplier.
 44. An improvement as recited in claim 41, wherein said adder array configuration preserves the regularity and locality of a standard array multiplier.
 45. An improvement as recited in claim 41, wherein said array multiplier has approximately the same complexity and delay as in a standard array multiplier.
 46. An improvement as recited in claim 41, wherein circuit switching is reduced in relation to a standard array multiplier.
 47. An improvement as recited in claim 41, wherein said partial-products are added sequentially according to decreasing wordlength.
 48. An improvement as recited in claim 41, wherein said array multiplier is Booth-encoded.
 49. An improvement as recited in claim 41, wherein said adder array comprises a carry-save adder array.
 50. An improvement as recited in claim 41, further comprising means for carrying out a shift-and-add operation.
 51. An array multiplier circuit configured to add partial-products according to their transition probabilities.
 52. An array multiplier as recited in claim 51, wherein partial-products are added starting with a most significant digit (MSD) partial product.
 53. An array multiplier as recited in claim 51, wherein the regularity and locality of a standard array multiplier is preserved.
 54. An array multiplier as recited in claim 51, wherein said array multiplier has approximately the same complexity and delay as in a standard array multiplier.
 55. An array multiplier as recited in claim 51, wherein circuit switching is reduced in relation to a standard array multiplier.
 56. An array multiplier as recited in claim 51, wherein partial-products are added sequentially with decreasing wordlength starting with the MSD partial-product.
 57. An array multiplier as recited in claim 51, wherein said array multiplier is Booth-encoded.
 58. An array multiplier as recited in claim 51, further comprising a carry-save adder array.
 59. An array multiplier as recited in claim 51, further comprising means for carrying out a shift-and-add operation.
 60. A method of reducing power dissipation in an array multiplier circuit, comprising: configuring said circuit to add partial-products according to their transition probabilities.
 61. A method as recited in claim 60, wherein said circuit is configured to add partial-products starting with a most significant digit (MSD) partial product.
 62. A method as recited in claim 60, wherein the regularity and locality of a standard array multiplier is preserved.
 63. A method as recited in claim 60, wherein said array multiplier has approximately the same complexity and delay as in a standard array multiplier.
 64. A method as recited in claim 60, wherein circuit switching is reduced in relation to a standard array multiplier.
 65. A method as recited in claim 60, wherein partial-products are added sequentially with decreasing wordlength starting with the MSD partial-product.
 66. A method as recited in claim 60, wherein said array multiplier is Booth-encoded.
 67. A method as recited in claim 60, wherein the array multiplier comprises a carry-save adder array.
 68. A method as recited in claim 60, wherein the array multiplier includes means for carrying out an additional shift-and-add operation. 